Netrunner Mate-in-1 or -2 is Weakly NP-Hard
نویسندگان
چکیده
We prove that deciding whether the Runner can win this turn (mate-in-1) in the Netrunner card game generalized to allow decks to contain an arbitrary number of copies of a card is weakly NP-hard. We also prove that deciding whether the Corp can win within two turns (mate-in-2) in this generalized Netrunner is weakly NP-hard.
منابع مشابه
Parallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملCliques and Clubs
Clubs are generalizations of cliques. For a positive integer s, an s-club in a graph G is a set of vertices that induces a subgraph of G of diameter at most s. The importance and fame of cliques are evident, whereas clubs provide more realistic models for practical applications. Computing an s-club of maximum cardinality is an NP-hard problem for every fixed s ≥ 1, and this problem has attracte...
متن کاملTheoretical Bounds on Mate-Pair Information for Accurate Genome Assembly
Over the past two decades, a series of works have aimed at studying the problem of genome assembly: the process of reconstructing a genome from sequence reads. An early formulation of the genome assembly problem showed that genome reconstruction is NP-hard when framed as finding the shortest sequence that contains all observed reads. Although this original formulation is very simplistic and doe...
متن کاملInverse p-median problems with variable edge lengths
The inverse p-median problem with variable edge lengths on graphs is to modify the edge lengths at minimum total cost with respect to given modification bounds such that a prespecified set of p vertices becomes a pmedian with respect to the new edge lengths. The problem is shown to be strongly NP-hard on general graphs and weakly NP-hard on series-parallel graphs. Therefore, the special case on...
متن کاملHardness of learning noisy halfspaces using polynomial thresholds
We prove the hardness of weakly learning halfspaces in the presence of adversarial noise using polynomial threshold functions (PTFs). In particular, we prove that for any constants d ∈ Z and ε > 0, it is NP-hard to decide: given a set of {−1, 1}-labeled points in Rn whether (YES Case) there exists a halfspace that classifies (1−ε)-fraction of the points correctly, or (NO Case) any degree-d PTF ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1710.05121 شماره
صفحات -
تاریخ انتشار 2017